Axiomatic districting
نویسندگان
چکیده
In a framework with two parties, deterministic voter preferences and a type of geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts one party can win, given the distribution of individual votes (the " optimal gerrymandering rule "). As a corollary, we obtain that no districting rule can satisfy our axioms and treat parties symmetrically.
منابع مشابه
Axiomatic Redistricting*
In a framework with two parties, deterministic voter preferences and geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts a party can win, given an electoral outcome (the " optimal gerrymandering rule "). As a corollary, we obtain that no districting rule can satisfy our axioms and treat p...
متن کاملA Continuous Districting Model Applied to Logistics Distribution Problems
The aim of districting problems is to get an optimized partition of a territory into smaller units, called districts or zones, subject to some side constraints such as balance, contiguity, and compactness. Logistics districting problems usuually involve additional optimization criteria and constraints. Districting problems are called continuous when the underlying space, both for facility sites...
متن کاملSocially Optimal Districting: a Theoretical and Empirical Exploration
This paper investigates the problem of optimal districting in the context of a simple model of legislative elections. In the model, districting matters because it determines the seat-vote curve, which describes the relationship between seats and votes. The paper rst characterizes the optimal seat-vote curve, and shows that, under a weak condition, there exist districtings that generate this ide...
متن کاملThe Political Districting Problem: A Survey*
Computer scientists and social scientists consider the political districting problem from different viewpoints. This paper gives an overview of both strands of the literature on districting in which the connections and the differences between the two approaches are highlighted.
متن کاملA computational approach to unbiased districting
In the context of discrete districting problems with geographical constraints, we demonstrate that determining an (ex post) unbiased districting, which requires that the number of representatives of a party should be proportional to its share of votes, turns out to be a computationally intractable (NP-complete) problem. This raises doubts as to whether an independent jury will be able to come u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 44 شماره
صفحات -
تاریخ انتشار 2015